A Fast Algorithm for Approximate Viewshed Computation
نویسنده
چکیده
Given a terrain model, the viewshed from a viewpoint is computed as the set of X-Y positions of a point target such that the target is visible. We introduce a novel approach to the computation of accurate viewshed approximations. Our algorithm relies on the computation of an approximation to the so-called line-of-sight (LOS) function. This function is defined over target X-Y positions, and is the highest elevation of a target so that it is still occluded from the viewpoint. The LOS function summarizes intervisibility information and permits reuse of previous intervisibility computations, resulting in computational efficiencies. Our algorithm gives results very close to the traditional sightline ray method at a substantially smaller computational cost, and is a generalization of the approach developed by Franklin and Ray for the same problem. We describe in detail the application to gridded terrain models, but the approach is similarly applicable to other elevation models.
منابع مشابه
Simultaneous computation of total viewshed on large high resolution grids
The knowledge of visibility information on a terrain is essential for a large number of current applications. There exist several algorithms in the literature for building visibility maps (VMs) but only for one single viewpoint or at most for a very small number of observers. This limitation is due to the high computational complexity of the used methods (which is greater than O(N2), where N is...
متن کاملEfficient viewshed computation on terrain in external memory
The recent availability of detailed geographic data permits terrain applications to process large areas at high resolution. However the required massive data processing presents significant challenges, demanding algorithms optimized for both data movement and computation. One such application is viewshed computation, that is, to determine all the points visible from a given point p. In this pap...
متن کاملSiting Observers on Terrain
This paper presents an experimental study of a new algorithm that synthesizes separate programs, for fast viewshed, and for fast approximate visibility index determination, into a working testbed for siting multiple observers jointly to cover terrain from a full level-1 DEM, and to do it so quickly that multiple experiments are easily possible. Both the observer and target may be at a given fix...
متن کاملAn Efficient Algorithm to Compute the Viewshed on DEM Terrains Stored in the External Memory
Nowadays, there is a huge volume of data about terrains available and generally, these data do not fit in the internal memory. So, many GIS applications require efficient algorithms to manipulate the data externally. One of these applications is the viewshed computation that consists in obtain the visible points from a given point p. In this paper, we present an efficient algorithm to compute t...
متن کاملRandomized Algorithm For 3-Set Splitting Problem and it's Markovian Model
In this paper we restrict every set splitting problem to the special case in which every set has just three elements. This restricted version is also NP-complete. Then, we introduce a general conversion from any set splitting problem to 3-set splitting. Then we introduce a randomize algorithm, and we use Markov chain model for run time complexity analysis of this algorithm. In the last section ...
متن کامل